On a programming language for graph algorithms
نویسندگان
چکیده
منابع مشابه
GRAph Parallel Actor Language — A Programming Language for Parallel Graph Algorithms
We introduce a domain-specific language, GRAph PArallel Actor Language, that enablesparallel graph algorithms to be written in a natural, high-level form. GRAPAL is based onour GraphStep compute model, which enables a wide range of parallel graph algorithmsthat are high-level, deterministic, free from race conditions, and free from deadlock. Pro-grams written in GRAPAL are easy ...
متن کاملA Graph Rewriting Programming Language for Graph Drawing
This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process. The languages which gave a diagrammatic view of graphs were not computa-tionally complete and so could not be used to implement complex graph drawing algorithms. Hence current graph drawing tools...
متن کاملThe Graph Programming Language GP
GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handling low-level data structures. The core of GP consists of four constructs: single-step application of a set of conditional graph-transformation rules, sequential composition, branching and iteration. This paper gives an overview ...
متن کاملConstraint Programming and Graph Algorithms
In the spring of ’99 my colleague Gert Smolka gave me a short introduction to constraint programming. During our discussion Gert emphasized that the search for efficient propagation algorithms leads to hard and well motivated questions in algorithmics. He pointed me to the papers [Reg94] by J.-C. Regin on “A filtering algorithm for constraints of difference in CSPs” and [GC97,GC00] by N. B. Gue...
متن کاملQuerying on a Persistent Graph Logic Programming Language
A problem with current database technology is its inability to represent complex relationships in a declarative form. Data models which can naturally represent complex structure must be able to describe a domain in a exible and accurate manner. The relational data model has in exible requirements for join tables and object-oriented databases emphasize behavior over representing structural infor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BIT
سال: 1972
ISSN: 0006-3835,1572-9125
DOI: 10.1007/bf01932817